Jumping to Conclusions - A Logico-Probabilistic Foundation for Defeasible Rule-Based Arguments

نویسنده

  • Bart Verheij
چکیده

A theory of defeasible arguments is proposed that combines logical and probabilistic properties. This logico-probabilistic argumentation theory builds on two foundational theories of nonmonotonic reasoning and uncertainty: the study of nonmonotonic consequence relations (and the associated minimal model semantics) and probability theory. A key result is that, in the theory, qualitatively defined argument validity can be derived from a quantitative interpretation. The theory provides a synthetic perspective of arguments ‘jumping to conclusions’, rules with exceptions, and probabilities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

evel-based Approach to Computing rranted Arguments in Possibilistic Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...

متن کامل

A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...

متن کامل

Neuro-Symbolic Agents: Boltzmann Machines and Probabilistic Abstract Argumentation with Sub-Arguments

Towards neuro-argumentative agents based on the seamless integration of neural networks and defeasible formalisms, with principled probabilistic settings and along efficient algorithms, we investigate argumentative Boltzmann machines where the possible states of a Boltzmann machine are constrained by a prior argumentative knowledge. To make our ideas as widely applicable as possible, and acknow...

متن کامل

An argumentation system for defeasible reasoning1

Rule-based argumentation systems are developed for reasoning about defeasibleinformation. They take as input a theory made of a set of facts, a set of strictrules, which encode strict information, and a set of defeasible rules which describegeneral behavior with exceptional cases. They build arguments by chaining suchrules, define attacks between them, use a semantics for evalua...

متن کامل

On resolving Conflicts between Arguments

Argument systems are based on the idea that one can construct arguments for propositions structured reasons justifying the belief in a proposition. Using defeasible rules, arguments need not be valid in all circumstances, therefore, it might be possible to construct an argument for a proposition as well as its negation. When arguments support conflicting propositions, one of the arguments must ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012